Forbidden graph characterization - PDFSEARCH.IO - Document Search Engine

Forbidden graph characterization
Results: 23

#	Item
11	Author’s manuscript accepted to Acta Informatica. Online available via DOIs00236Exploiting a Hypergraph Model for Finding Golomb Rulers Manuel Sorge · Hannes Moser · Rolf Niedermeier · Mathias W Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-07-11 05:17:50 Combinatorics Hypergraph Golomb ruler Forbidden graph characterization Bipartite graph Incidence matrix Sidon sequence Line graph of a hypergraph Graph theory Mathematics Number theory
12	G RA M I: Frequent Subgraph and Pattern Mining in a Single Large Graph Mohammed Elseidy Ehab Abdelhamid Spiros Skiadopoulos ∗ Panos Kalnis Add to Reading List Source URL: www.vldb.org Language: English - Date: 2014-02-06 11:09:52 Ancestral graph Forbidden graph characterization Graph theory Tree Graph operations
13	Discriminative frequent subgraph mining with optimality guarantees Marisa Thoma∗ Alex Smola¶ Hong Cheng† Le Song‡ Add to Reading List Source URL: www.dbs.ifi.lmu.de Language: English - Date: 2010-07-07 07:38:39 Graph Forbidden graph characterization Dense subgraph Graph theory Cograph Submodular set function
14	Cops and Robbers A Senior Project submitted to The Division of Science, Mathematics, and Computing of Bard College Add to Reading List Source URL: math.bard.edu Language: English - Date: 2012-11-16 16:05:31 Tree decomposition Forbidden graph characterization Planar graphs Entanglement Pursuit-evasion Graph theory Graph operations Minor
15	A Program of the Institute for Advanced Study and Princeton University Combinatorics and Graph Theory 2013 Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2012-10-26 11:30:34 Maria Chudnovsky Perfect graph Discrete mathematics Forbidden graph characterization Jon Folkman Budapest Semesters in Mathematics Graph theory Mathematics Combinatorics
16	THEOREM OF THE DAY Wagner’s Theorem A graph G is planar if and only if it contains neither K5 nor K3,3 as a graph minor. The graph above left is the famous Petersen graph. Its nonplanarity can be confirmed by Kuratowsk Add to Reading List Source URL: www.theoremoftheday.org Language: English - Date: 2014-02-07 05:07:17 Planar graph Robertson–Seymour theorem Klaus Wagner Graph Graph coloring Forbidden graph characterization Snark Graph theory Minor Petersen graph
17	Mining Spatial Motifs from Protein Structure Graphs Jun Huan1 , Wei Wang1 , Deepak Bandyopadhyay1 , Jack Snoeyink1 , Jan Prins1 , Alex Tropsha2 1 Department of Computer Science, University of North Carolina, Chapel Hill Add to Reading List Source URL: www.cs.unc.edu Language: English - Date: 2003-12-06 16:28:00 Delaunay triangulation Cograph Matching Forbidden graph characterization Clique Graph theory Graph operations Graph
18	GAIA: Graph Classification Using Evolutionary Computation Ning Jin Calvin Young Add to Reading List Source URL: www.cs.ucla.edu Language: English - Date: 2010-04-06 10:54:25 Cograph Matroid theory Neighbourhood Forbidden graph characterization Graph theory Graph operations Subgraph isomorphism problem
19	A Characterization of the (natural) Graph Properties Testable with One-Sided Error Noga Alon ∗ Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2005-09-21 05:52:48 Chordal graph Induced path Forbidden graph characterization Hereditary property Neighbourhood Graph Clique Path decomposition Aanderaa–Karp–Rosenberg conjecture Graph theory Graph property Graph coloring
20	Minimum Cuts and Shortest Homologous Cycles∗ Erin W. Chambers Jeff Erickson Department of Computer Science and Mathematics Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2009-08-14 15:23:44 Planar graphs Spanning tree Graph coloring Minor Minimum spanning tree Graph embedding Shortest path problem Forbidden graph characterization Matching Graph theory Mathematics Topological graph theory